Message passing and moment closure for susceptible-infected-recovered epidemics on finite networks.
نویسندگان
چکیده
The message passing approach of Karrer and Newman [Phys. Rev. E 82, 016101 (2010)] is an exact and practicable representation of susceptible-infected-recovered dynamics on finite trees. Here we show that, assuming Poisson contact processes, a pair-based moment-closure representation [Sharkey, J. Math. Biol. 57, 311 (2008)] can be derived from their equations. We extend the applicability of both representations and discuss their relative merits. On arbitrary time-independent networks, as was shown for the message passing formalism, the pair-based moment-closure equations also provide a rigorous lower bound on the expected number of susceptibles at all times.
منابع مشابه
The deterministic Kermack-McKendrick model bounds the general stochastic epidemic
We prove that, for Poisson transmission and recovery processes, the classic Susceptible → Infected → Recovered (SIR) epidemic model of Kermack and McKendrick provides, for any given time t > 0, a strict lower bound on the expected number of suscpetibles and a strict upper bound on the expected number of recoveries in the general stochastic SIR epidemic. The proof is based on the recent message ...
متن کاملMaximum-entropy moment-closure for stochastic systems on networks
Moment-closure methods are popular tools to simplify the mathematical analysis of stochastic models defined on networks, in which high dimensional joint distributions are approximated (often by some heuristic argument) as functions of lower dimensional distributions. Whilst undoubtedly useful, several such methods suffer from issues of non-uniqueness and inconsistency. These problems are solved...
متن کاملExact and approximate moment closures for non-Markovian network epidemics.
Moment-closure techniques are commonly used to generate low-dimensional deterministic models to approximate the average dynamics of stochastic systems on networks. The quality of such closures is usually difficult to asses and furthermore the relationship between model assumptions and closure accuracy are often difficult, if not impossible, to quantify. Here we carefully examine some commonly u...
متن کاملInferring the origin of an epidemic with a dynamic message-passing algorithm
We study the problem of estimating the origin of an epidemic outbreak: given a contact network and a snapshot of epidemic spread at a certain time, determine the infection source. This problem is important in different contexts of computer or social networks. Assuming that the epidemic spread follows the usual susceptible-infected-recovered model, we introduce an inference algorithm based on dy...
متن کاملA message passing approach for general epidemic models
In most models of the spread of disease over contact networks it is assumed that the probabilities per unit time of disease transmission and recovery from disease are constant, implying exponential distributions of the time intervals for transmission and recovery. Time intervals for real diseases, however, have distributions that in most cases are far from exponential, which leads to disagreeme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 89 2 شماره
صفحات -
تاریخ انتشار 2014